|
The change-making problem addresses the following question: how can a given amount of money be made with the least number of coins of given denominations? It is a knapsack type problem, and has applications wider than just currency. ==Mathematical definition== Coin values can be modeled by a set of distinct positive integer values (whole numbers), arranged in increasing order as through . The problem is: given an amount , also a positive integer, to find a set of non-negative (positive or zero) integers }, with each representing how often the coin with value is used, which minimize the total number of coins : subject to : 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Change-making problem」の詳細全文を読む スポンサード リンク
|